The eigenvalues of stochastic blockmodel graphs
نویسنده
چکیده
We derive the joint limiting distribution for the largest eigenvalues of the adjacency matrix for stochastic blockmodel graphs when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate normal with bounded covariances. Our result extends the classical result of Füredi and Komlós on the fluctuation of the largest eigenvalue for Erdős-Rényi graphs.
منابع مشابه
Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
Vertex clustering in a stochastic blockmodel graph has wide applicability and has been the subject of extensive research. In this paper, we provide a short proof that the adjacency spectral embedding can be used to obtain perfect clustering for the stochastic blockmodel and the degreecorrected stochastic blockmodel. We also show an analogous result for the more general random dot product graph ...
متن کاملUnperturbed: spectral analysis beyond Davis-Kahan
Classical matrix perturbation results, such as Weyl’s theorem for eigenvalues andthe Davis-Kahan theorem for eigenvectors, are general purpose. These classicalbounds are tight in the worst case, but in many settings sub-optimal in the typicalcase. In this paper, we present perturbation bounds which consider the nature ofthe perturbation and its interaction with the unperturbed s...
متن کاملCo-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries. We give a spectral algorithm called di-sim that builds on a dual measure of similarity that correspond to how a node (i) sends and (ii) receives edges. Using di-sim, we analyze the global asymmetries in the networks of Enron emails, p...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کامل